Trees with unique minimum global offensive alliance
نویسندگان
چکیده
Let G = ( V, E ) be a simple graph. A non-empty set D ⊆ V is called global offensive alliance if dominating and for every vertex ν in − , | N [ν] ∩ |≥| |. The number the minimum cardinality of . In this paper, we give constructive characterization trees having unique alliance.
منابع مشابه
Global offensive alliance numbers in graphs with emphasis on trees
For a graph G = (V,E), a non-empty set S ⊆ V is a global offensive alliance if for every v ∈ V − S, at least half of the vertices from the closed neighborhood of v are in S. A set S ⊆ V is a global strong offensive alliance if for each vertex v ∈ V −S, a strict majority of the vertices of the closed neighborhood of v are in S. The cardinality of a minimum global (strong) offensive alliance of a...
متن کاملGLOBAL OFFENSIVE k-ALLIANCE IN BIPARTITE GRAPHS
Let k ≥ 0 be an integer. A set S of vertices of a graph G = (V (G), E(G)) is called a global offensive k-alliance if |N(v) ∩ S| ≥ |N(v) − S| + k for every v ∈ V (G) − S, where 0 ≤ k ≤ ∆ and ∆ is the maximum degree of G. The global offensive k-alliance number γ o (G) is the minimum cardinality of a global offensive k-alliance in G. We show that for every bipartite graph G and every integer k ≥ 2...
متن کاملIndependence and global offensive alliance in graphs
Let G be a simple graph with vertex set V (G). A non-empty set S ⊆ V (G) is a global strong offensive alliance if for every vertex v in V (G)−S, a strict majority of its closed neighborhood is in S. The global strong offensive alliance number γô(G) is the minimum cardinality of a global strong offensive alliance of G. We show that if G is a connected bipartite graph of order at least three, the...
متن کاملBounds on the global offensive k-alliance number in graphs
Let G = (V (G), E(G)) be a graph, and let k ≥ 1 be an integer. A set S ⊆ V (G) is called a global offensive k-alliance if |N(v) ∩ S| ≥ |N(v)−S|+k for every v ∈ V (G)−S, where N(v) is the neighborhood of v. The global offensive k-alliance number γ o (G) is the minimum cardinality of a global offensive k-alliance in G. We present different bounds on γ o (G) in terms of order, maximum degree, inde...
متن کاملOn the global offensive alliance number of a graph
An offensive alliance in a graph Γ = (V,E) is a set of vertices S ⊂ V where for every vertex v in its boundary it holds that the majority of vertices in v’s closed neighborhood are in S. In the case of strong offensive alliance, strict majority is required. An alliance S is called global if it affects every vertex in V \S, that is, S is a dominating set of Γ. The offensive alliance number ao(Γ)...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Rairo-operations Research
سال: 2021
ISSN: ['1290-3868', '0399-0559']
DOI: https://doi.org/10.1051/ro/2020017